Singular value decompositions of complex symmetric matrices

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Singular value inequalities for positive semidefinite matrices

In this note‎, ‎we obtain some singular values inequalities for positive semidefinite matrices by using block matrix technique‎. ‎Our results are similar to some inequalities shown by Bhatia and Kittaneh in [Linear Algebra Appl‎. ‎308 (2000) 203-211] and [Linear Algebra Appl‎. ‎428 (2008) 2177-2191]‎.

متن کامل

Sum Decompositions of Symmetric Matrices

Given a symmetric n X n matrix A and n numbers rl," " rn , necessary and sufficient conditions for the existence of a matrix B, with a given zero pattern, with row sums r 1 , ... , rn , and such that A = B + BT are proven. If the pattern restriction * The research of all three authors was supported by the Funda~ao Calouste Gulbenkian, Lisboa. tThe research of this author was carried out within ...

متن کامل

On the least singular value of random symmetric matrices

Let Fn be an n by n symmetric matrix whose entries are bounded by n γ for some γ > 0. Consider a randomly perturbed matrix Mn = Fn +Xn, where Xn is a random symmetric matrix whose upper diagonal entries xij , 1 ≤ i ≤ j, are iid copies of a random variable ξ. Under a very general assumption on ξ, we show that for any B > 0 there exists A > 0 such that P(σn(Mn) ≤ n−A) ≤ n−B .

متن کامل

Continuation of Singular Value Decompositions

In this work we consider computing a smooth path for a (block) singular value decomposition of a full rank matrix valued function. We give new theoretical results and then introduce and implement several algorithms to compute a smooth path. We illustrate performance of the algorithms with a few numerical examples.

متن کامل

Tangential Frequency Ltering Decompositions for Symmetric Matrices

The tangential frequency ltering decomposition (TFFD) is introduced. The convergence theory of an iterative scheme based on the TFFD for symmetric matrices is the focus of this paper. The existence of the TFFD and the convergence of the induced iterative algorithm is shown for symmetric and positive deenite matrices. Convergence rates independent of the number of unknowns are proven for a small...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational and Applied Mathematics

سال: 1988

ISSN: 0377-0427

DOI: 10.1016/0377-0427(88)90386-x